package com.ctrip.demo.leetcode;

public class Leetcode1217 {

    public static void main(String[] args) {
        System.out.println(100022757 % 20);
    }

    public int minCostToMoveChips(int[] position) {
        int odd = 0;
        int even = 0;
        for (int i = 0; i < position.length; i++) {
            int res = position[i] % 2 == 0 ? odd++ : even++;
        }

        return Math.min(odd, even);
    }
}
